Rectangle | Square | Circle
- Check whether a given point lies inside a rectangle or not
- Program for Area And Perimeter Of Rectangle
- Find if two rectangles overlap
- How to check if given four points form a square
- Number of rectangles in N*M grid
- Program to find Circumference of a Circle
- Program to find area of a circle
- Check whether a point exists in circle sector or not
- Check if two given circles touch or intersect each other
- Program to find area of a Circular Segment
- Check if a line touches or intersects a circle
- Area of a Circumscribed Circle of a Square
- Find minimum radius such that atleast k point lie inside the circle
- Angular Sweep (Maximum points that can be enclosed in a circle of given radius)
Geometric Algorithms
Geometric algorithms are a type of algorithm that deal with solving problems related to geometry. These algorithms are used to solve various geometric problems such as computing the area of a polygon, finding the intersection of geometric shapes, determining the convex hull of a set of points, and many other tasks related to geometric objects and their properties. Geometric algorithms are important in various fields such as computer graphics, computer-aided design, robotics, and geographical information systems.
Table of Content
- What are Geometric Algorithms?
- Pattern Printing
- Lines
- Triangle
- Rectangle | Square | Circle
- Quadrilateral
- 3D Objects
- Polygon and Convex Hull
- Standard Problems on Geometric Algorithm
Contact Us